Complementarity spectrum of digraphs
نویسندگان
چکیده
In this paper we study the complementarity spectrum of digraphs, with special attention to problem digraph characterization through spectrum. That is, whether two non-isomorphic digraphs same number vertices can have eigenvalues. The eigenvalues matrices, also called Pareto eigenvalues, has led (undirected) graphs and, in particular, undirected these is an open problem. We characterize one and give examples
منابع مشابه
On the spectrum of subKautz and cyclic Kautz digraphs
Kautz digraphs K(d, `) are a well-known family of dense digraphs, widely studied as a good model for interconnection networks. Closely related with these, the cyclic Kautz CK(d, `) and the subKautz sK(d, 2) digraphs were recently introduced by Böhmová, Huemer and the author. In this paper we propose a new method to obtain the complete spectra of subKautz sK(d, 2) and cyclic Kautz CK(d, 3) digra...
متن کاملThe Laplacian spectrum of some digraphs obtained from the wheel
The problem of distinguishing, in terms of graph topology, digraphs with real and partially non-real Laplacian spectra is important for applications. Motivated by the question posed in [R. Agaev, P. Chebotarev, Which digraphs with rings structure are essentially cyclic?, Adv. in Appl. Math. 45 (2010), 232–251], in this paper we completely list the Laplacian eigenvalues of some digraphs obtained...
متن کاملMore skew-equienergetic digraphs
Two digraphs of same order are said to be skew-equienergetic if their skew energies are equal. One of the open problems proposed by Li and Lian was to construct non-cospectral skew-equienergetic digraphs on n vertices. Recently this problem was solved by Ramane et al. In this paper, we give some new methods to construct new skew-equienergetic digraphs.
متن کاملBlock Line Cut Vertex Digraphs of Digraphs
In this paper, the digraph valued function(digraph operator), namely the block line cut vertex digraph BLC(D) of a digraph D is defined, and the problem of reconstructing a digraph from its block line cut vertex digraph is presented. Outer planarity, maximal outer planarity, and minimally non-outer planarity properties of these digraphs are discussed.
متن کاملVertex Removable Cycles of Graphs and Digraphs
In this paper we defined the vertex removable cycle in respect of the following, if $F$ is a class of graphs(digraphs) satisfying certain property, $G in F $, the cycle $C$ in $G$ is called vertex removable if $G-V(C)in in F $. The vertex removable cycles of eulerian graphs are studied. We also characterize the edge removable cycles of regular graphs(digraphs).
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 2021
ISSN: ['1873-1856', '0024-3795']
DOI: https://doi.org/10.1016/j.laa.2021.06.001